#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL dp[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  ///cout<<min((n-2)*(n-1)*n/6,n*n*(LL)log(n))<<endl;
  dp[0]=1;dp[1]=2;dp[2]=3;dp[3]=5;
  bool flag=1;
  for(LL i=4;i<=n;i++){
    if(flag) {
        dp[i]=dp[i-1]+dp[i-2];
    }
    if(flag==0||dp[i]>1e9){
        ///cout<<i<<endl;
        flag=0;
        dp[i]=1;
    }
  }
 /// cout<<sum<<endl;
  for(LL i=1;i<=n;i++){
    cout<<dp[i]<<" ";
  }
  cout<<"\n";
return 0;
}
